Building a Cathedral
نویسندگان
چکیده
منابع مشابه
The Cathedral and the Bazaar
Permission is granted to copy, distribute and/or modify this document under the terms of the Open Publication License, version 2.0. $Date: 2002/08/02 09:02:14 $ Revision History Revision 1.57 11 September 2000 esr New major section “How Many Eyeballs Tame Complexity”. Revision 1.52 28 August 2000 esr MATLAB is a reinforcing parallel to Emacs. Corbatoó & Vyssotsky got it in 1965. Revision 1.51 2...
متن کاملOn open source software and the organization of cathedral-building: metaphors and realities
Eric S. Raymond’s (1999) influential essay The Cathedral and the Bazaar paints contrasting pictures of the orderly, hierarchically controlled programs of planning and execution that built the great cathedrals of Europe, on the one hand, and, on the other, the ferment and seeming chaos of the bazaar. The latter then is offered as a metaphor for the mode through which free/libre and open source s...
متن کاملMathematics at Chartres Cathedral
Having had several opportunities to travel to France, often with groups of students, our trips have usually included a visit to Chartres, especially to visit the magnificent Gothic cathedral that dominates the town. On a recent visit I was again struck by the beauty, majesty and awe that the cathedral inspires. The building not only does a remarkable job of telling Biblical stories and of enclo...
متن کاملAn Alternative Proof of Lovász’s Cathedral Theorem
A graph G with a perfect matching is called saturated if G + e has more perfect matchings than G for any edge e that is not in G. Lovász gave a characterization of the saturated graphs called the cathedral theorem, with some applications to the enumeration problem of perfect matchings, and later Szigeti gave another proof. In this paper, we give a new proof with our preceding works which reveal...
متن کاملThe Third Proof of Lovász's Cathedral Theorem
This paper is on matching theory. A graph with perfect matching is called saturated if any addition of one complement edge creates a new perfect matching. Lovász gave a characterization of the saturated graphs called the cathedral theorem, and later Szigeti gave another proof. In this paper, we gave a new proof with our preceding works, which revealed the canonical structure of general graph wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cancer Biology & Therapy
سال: 2006
ISSN: 1538-4047,1555-8576
DOI: 10.4161/cbt.5.2.2508